Efficient Classifier Generation over Stream Sliding Window using Associative Classification Approach
نویسندگان
چکیده
Prominence of data streams has dragged the interest of many researchers in the recent past. Mining associative rules generated on data streams for prediction has raised greater research interest in recent years. Associative classification mining has shown better performance over many former classification techniques in Data Mining and Data Stream Mining domains. This paper introduces a new technique for mining data streams using associative classification. To the best of our knowledge there are only few techniques existing. We designed a compact data structure to efficiently maintain data streams without losing any important information. We present a PSToSW for mining rules from the tree. Subsequently, an optimized algorithm called PSToSWMine is proposed for mining a classifier which contains set of high qualified classification rules. We then conduct experiments using synthetic and real data sets to assess the performance of our approach. The experimental results show that our technique is superior to existing algorithms which perform similar tasks in terms of accuracy of prediction and run time efficiency.
منابع مشابه
Efficient Classifier over Stream Sliding Window using Associative Classification
Prominence of data streams has dragged the interest of many researchers in the recent past. Research is going in the direction of formulating association rules on data streams for the purpose of prediction. From among the classification techniques the associative classification mining stands out with better performance over former classification techniques. A new technique is introduced through...
متن کاملCompact Tree for Associative Classification of Data Stream Mining
The data streams have recently emerged to address the problems of continuous data. Mining with data streams is the process of extracting knowledge structures from continuous, rapid data records [1]. An important goal in data stream mining is generation of compact representation of data. This helps in reducing time and space needed for further decision making process. In this paper we propose a ...
متن کاملMining frequent itemsets over data streams using efficient window sliding techniques
Online mining of frequent itemsets over a stream sliding window is one of the most important problems in stream data mining with broad applications. It is also a difficult issue since the streaming data possess some challenging characteristics, such as unknown or unbound size, possibly a very fast arrival rate, inability to backtrack over previously arrived transactions, and a lack of system co...
متن کاملSentiment Classification over Opinionated Data Streams Through Informed Model Adaptation
Opinionated data streams are very popular data paradigms nowadays as more and more users share their opinions online about almost everything from products to persons, brands and ideas. One of the key challenges for opinionated stream mining is dealing with concept drifts in the underlying stream population by building learners that adapt to such concept changes. Ageing is a typical way of adapt...
متن کاملA Novel method of Data Stream Classification Based on Incremental Storage Tree
For the characteristics of large number, fast change, high cost of random access of data stream, this paper proposes a Bayesian classification data mining algorithm based on incremental storage tree to handle the problems. Use sliding window to process data stream and divide it into several basic units, apply Principal component analysis (PCA) to compress the data from window and produce dynami...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015